﻿using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace CodeFound
{

    public class SimpleDictionary<T>
    {
        public static bool IsPrime(int candidate)
        {
            if ((candidate & 1) != 0)
            {
                int limit = (int)Math.Sqrt(candidate);
                for (int divisor = 3; divisor <= limit; divisor += 2)
                {
                    if ((candidate % divisor) == 0)
                        return false;
                }
                return true;
            }
            return (candidate == 2);
        }
        public static int GetPrime(int min)
        {
            for (int i = 0; i < primes.Length; i++)
            {
                int prime = primes[i];
                if (prime >= min) return prime;
            }

            //outside of our predefined table. 
            //compute the hard way. 
            for (int i = (min | 1); i < Int32.MaxValue; i += 2)
            {
                if (IsPrime(i) && ((i - 1) % Hashtable.HashPrime != 0))
                    return i;
            }
            return min;
        }
        public static readonly int[] primes = {
            3, 7, 11, 17, 23, 29, 37, 47, 59, 71, 89, 107, 131, 163, 197, 239, 293, 353, 431, 521, 631, 761, 919,
            1103, 1327, 1597, 1931, 2333, 2801, 3371, 4049, 4861, 5839, 7013, 8419, 10103, 12143, 14591,
            17519, 21023, 25229, 30293, 36353, 43627, 52361, 62851, 75431, 90523, 108631, 130363, 156437,
            187751, 225307, 270371, 324449, 389357, 467237, 560689, 672827, 807403, 968897, 1162687, 1395263,
            1674319, 2009191, 2411033, 2893249, 3471899, 4166287, 4999559, 5999471, 7199369};
        private struct Entry
        {
            public long hashCode;    // Lower 31 bits of hash code, -1 if unused
            public int next;        // Index of next entry, -1 if last
            public long key;           // Key of entry
            public T value;         // Value of entry
        }
        private int[] buckets;
        private Entry[] entries;
        private int count;
        private int freeList;
        private int freeCount;
        private void Initialize(int capacity)
        {
            if(capacity.GetTypeCode())
            int size = capacity;
            buckets = new int[size];
            for (int i = 0; i < buckets.Length; i++) buckets[i] = -1;
            entries = new Entry[size];
        }
        
        T[] items = new T[23];
        public SimpleDictionary() {
            list = new List<T>();
        }
        public T this[long hashCode]
        {
            get{ return Get(hashCode); }
            set { Set(hashCode, value); }    
        }
        public T Get(long hashCode)
        {
            return default(T);
        }
        public void Set(long hashCode, T value)
        {
            
        }
        public int ContainsKey(long hashCode)
        {
            for (int i = buckets[hashCode % buckets.Length]; i >= 0; i = entries[i].next)
            {
                if (entries[i].hashCode == hashCode) return i;
            }
            return -1;
        }
    }
        public void Add(long hashCode,T value)
        {
            int targetBucket= (int)(hashCode % buckets.Length);
            for (int i = buckets[targetBucket]; i >= 0; i = entries[i].next)
            {
                if (entries[i].hashCode == hashCode)
                {
                    entries[i].value = value;
                }
            }
            int index=entries.Length;
            entries[index].hashCode = hashCode;
            entries[index].key = hashCode;
            entries[index].value = value;
            entries[index].next = buckets[targetBucket];
            buckets[targetBucket] = index;
        }
    }
}
